DE5_OA_Ankur edit

نویسنده

  • Ankur G. Shah
چکیده

Background: AIM: Dental anxiety is one of the major factors influencing an individual’s attitude and behavior towards dental health. Medical students bear the responsibility of creating dental health awareness in rural parts of India where availability of dentists is still a problem. This study assessed the prevalence of dental anxiety among medical undergraduate students and its impact on their dental health behavior. Methods: Total 196 students were included in this study out of which 81 were males ad 115 were females. All the participants answered 3 multiple-choice questions regarding their dental health behavior and filled up Modified dental anxiety scale (MDAS) questionnaire. Collected data were subjected to statistical analysis and results were expressed as absolute numbers and percentages for males and females. Gender-wise comparison to their responses was also made using chi-square test. Results: On analyzing the data, it was observes that 85.7% subjects who had “poor” previous dental experience were dentally anxious. 81.8% subjects with MDAS score between 11 and 25 tended to postpone dental treatment. Irrespective of gender, anticipation to have local anaesthetic injection was related to the highest level of dental anxiety. 13% of females and 9.9% of male participants were found to be dentally phobic (MDA score ≥ 19). Mean MDA score was higher in female students (12.17 ± 4.24) as compared to their male counterparts (11.36 ± 3.51) but this difference was statistically not significant (p>0.05). Conclusion: From the findings of this study, it can be concluded that dental anxiety is a significant problem among the Indian medical undergraduate students. As a result of this, these students tend to avoid regular visit to dentist which in turn might affect their dental health.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

The edit distance between two rooted ordered trees with n nodes labeled from an alphabet Σ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit dist...

متن کامل

Map Edit Distance vs. Graph Edit Distance for Matching Images

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...

متن کامل

A Quadratic Programming Approach to the Graph Edit Distance Problem

In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...

متن کامل

An Eecient Uniform-cost Normalized Edit Distance Algorithm

A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given ...

متن کامل

Edit Distance From Graph Spectra

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017